Maximal value of the zeroth-order Randić index
نویسندگان
چکیده
منابع مشابه
Maximal Value of the Zeroth-order Randic Index
Let G(n; m) be a connected graph without loops and multiple edges which has n vertices and m edges. We ÿnd the graphs on which the zeroth-order connectivity index, equal to the sum of degrees of vertices of G(n; m) raised to the power − 1 2 , attains maximum.
متن کاملA note on the zeroth-order general randić index of cacti and polyomino chains
The present note is devoted to establish some extremal results for the zeroth-order general Randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
متن کاملa note on the zeroth-order general randić index of cacti and polyomino chains
the present note is devoted to establish some extremal results for the zeroth-order general randi'{c} index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
متن کاملon the first extended zeroth-order connectivity index of trees
the first extended zeroth-order connectivity index of a graph g is defined as 0 1/2 1 ( ) ( ) , v v v g g d where v (g) is the vertex set of g, and v d is the sum of degrees of neighbors of vertex v in g. we give a sharp lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and pendant vertices,...
متن کاملOn the Higher Randić Index
Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih v v v over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00392-x